Heavy-traffic analysis of k-limited polling systems
نویسنده
چکیده
In this paper we study a two-queue polling model with zero switch-over times and k-limited service (serve at most ki customers during one visit period to queue i , i = 1, 2) in each queue. The arrival processes at the two queues are Poisson, and the service times are exponentially distributed. By increasing the arrival intensities until one of the queues becomes critically loaded, we derive exact heavy-traffic limits for the joint queue-length distribution using a singular-perturbation technique. It turns out that the number of customers in the stable queue has the same distribution as the number of customers in a vacation system with Erlang-k2 distributed vacations. The queue-length distribution of the critically loaded queue, after applying an appropriate scaling, is exponentially distributed. Finally, we show that the two queue-length processes are independent in heavy traffic.
منابع مشابه
Critically loaded k-limited polling systems with switch-over times
We consider a two-queue polling model with switch-over times and k-limited service (serve at most k i customers during one visit period to queue i) in each queue. The major benefit of the k-limited service discipline is that it-besides bounding the cycle time-effectuates prioritization by assigning different service limits to different queues. System performance is studied in the heavy-traffic ...
متن کاملCritically loaded k-limited polling systems
We consider a two-queue polling model with switch-over times and k-limited service (serve at most ki customers during one visit period to queue i) in each queue. The major benefit of the k-limited service discipline is that it besides bounding the cycle time effectuates prioritization by assigning different service limits to different queues. System performance is studied in the heavy-traffic r...
متن کاملDecomposition results for general polling systems and their applications
In this paper we derive decomposition results for the number of customers in polling systems under arbitrary (dynamic) polling order and service policies. Furthermore, we obtain sharper decomposition results for both the number of customers in the system and the waiting times under static polling policies. Our analysis, which is based on distributional laws, relaxes the Poisson assumption that ...
متن کاملExpected Delay Analysis of Polling Systems in Heavy Traffic
We study the expected delay in a cyclic polling model with mixtures of exhaustive and gated service in heavy traffic. We obtain closed-form expressions for the mean delay under standard heavy-traffic scalings, providing new insights into the behaviour of polling systems in heavy traffic. The results lead to excellent approximations of the expected waiting times in practical heavy-load scenarios...
متن کامل